TSTP Solution File: SEV049^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV049^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:41:11 EDT 2024
% Result : Theorem 0.15s 0.32s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 2 unt; 4 typ; 0 def)
% Number of atoms : 130 ( 41 equ; 0 cnn)
% Maximal formula atoms : 6 ( 8 avg)
% Number of connectives : 171 ( 17 ~; 7 |; 24 &; 116 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 104 ( 104 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 75 ( 32 ^ 24 !; 18 ?; 75 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_4,type,
sK0: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(func_def_5,type,
sK1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(func_def_6,type,
sK2: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(func_def_9,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f25,plain,
$false,
inference(trivial_inequality_removal,[],[f24]) ).
thf(f24,plain,
$false = $true,
inference(duplicate_literal_removal,[],[f23]) ).
thf(f23,plain,
( ( $false = $true )
| ( $false = $true ) ),
inference(beta_eta_normalization,[],[f19]) ).
thf(f19,plain,
( ( ( ^ [Y0: $i > $o,Y1: $i > $o] : $false
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false )
= $true )
| ( ( ^ [Y0: $i > $o,Y1: $i > $o] : $false
@ ( sK1
@ ^ [Y0: $i > $o,Y1: $i > $o] : $false )
@ ( sK2
@ ^ [Y0: $i > $o,Y1: $i > $o] : $false ) )
= $true ) ),
inference(primitive_instantiation,[],[f13]) ).
thf(f13,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( ( X0 @ ( sK1 @ X0 ) @ ( sK2 @ X0 ) )
= $true )
| ( ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false )
= $true ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( ( ( X0 @ ( sK1 @ X0 ) @ ( sK0 @ X0 ) )
!= $true )
& ( $true
= ( X0 @ ( sK2 @ X0 ) @ ( sK0 @ X0 ) ) )
& ( ( X0 @ ( sK1 @ X0 ) @ ( sK2 @ X0 ) )
= $true ) )
| ( ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f10,f11]) ).
thf(f11,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ? [X1: $i > $o,X2: $i > $o,X3: $i > $o] :
( ( $true
!= ( X0 @ X2 @ X1 ) )
& ( ( X0 @ X3 @ X1 )
= $true )
& ( ( X0 @ X2 @ X3 )
= $true ) )
=> ( ( ( X0 @ ( sK1 @ X0 ) @ ( sK0 @ X0 ) )
!= $true )
& ( $true
= ( X0 @ ( sK2 @ X0 ) @ ( sK0 @ X0 ) ) )
& ( ( X0 @ ( sK1 @ X0 ) @ ( sK2 @ X0 ) )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ? [X1: $i > $o,X2: $i > $o,X3: $i > $o] :
( ( $true
!= ( X0 @ X2 @ X1 ) )
& ( ( X0 @ X3 @ X1 )
= $true )
& ( ( X0 @ X2 @ X3 )
= $true ) )
| ( ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false )
= $true ) ),
inference(rectify,[],[f9]) ).
thf(f9,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ? [X2: $i > $o,X3: $i > $o,X1: $i > $o] :
( ( ( X0 @ X3 @ X2 )
!= $true )
& ( ( X0 @ X1 @ X2 )
= $true )
& ( ( X0 @ X3 @ X1 )
= $true ) )
| ( ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false )
= $true ) ),
inference(flattening,[],[f8]) ).
thf(f8,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false )
= $true )
| ? [X3: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( ( X0 @ X3 @ X2 )
!= $true )
& ( ( X0 @ X1 @ X2 )
= $true )
& ( ( X0 @ X3 @ X1 )
= $true ) ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f7,plain,
~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false )
!= $true )
& ! [X3: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( ( ( X0 @ X1 @ X2 )
= $true )
& ( ( X0 @ X3 @ X1 )
= $true ) )
=> ( ( X0 @ X3 @ X2 )
= $true ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false )
!= $true )
& ! [X3: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( ( ( X0 @ X1 @ X2 )
= $true )
& ( ( X0 @ X3 @ X1 )
= $true ) )
=> ( ( X0 @ X3 @ X2 )
= $true ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,plain,
~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( ( X0
@ ^ [Y0: $i] : $true
@ ^ [Y0: $i] : $false )
!= $true )
& ! [X3: $i > $o,X4: $i > $o,X5: $i > $o] :
( ( ( ( X0 @ X3 @ X4 )
= $true )
& ( ( X0 @ X5 @ X3 )
= $true ) )
=> ( ( X0 @ X5 @ X4 )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( X0
@ ^ [X1: $i] : $true
@ ^ [X2: $i] : $false )
& ! [X3: $i > $o,X4: $i > $o,X5: $i > $o] :
( ( ( X0 @ X3 @ X4 )
& ( X0 @ X5 @ X3 ) )
=> ( X0 @ X5 @ X4 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( X0
@ ^ [X1: $i] : $true
@ ^ [X1: $i] : $false )
& ! [X2: $i > $o,X3: $i > $o,X1: $i > $o] :
( ( ( X0 @ X2 @ X3 )
& ( X0 @ X1 @ X2 ) )
=> ( X0 @ X1 @ X3 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ~ ( X0
@ ^ [X1: $i] : $true
@ ^ [X1: $i] : $false )
& ! [X2: $i > $o,X3: $i > $o,X1: $i > $o] :
( ( ( X0 @ X2 @ X3 )
& ( X0 @ X1 @ X2 ) )
=> ( X0 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.AbzvDzhada/Vampire---4.8_1292',cTHM120A_pme) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SEV049^5 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.30 % Computer : n002.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 12:10:12 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a TH0_THM_NEQ_NAR problem
% 0.10/0.30 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.AbzvDzhada/Vampire---4.8_1292
% 0.15/0.32 % (1404)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.15/0.32 % (1406)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.15/0.32 % (1409)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.15/0.32 % (1408)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.15/0.32 % (1410)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.15/0.32 % (1407)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.15/0.32 % (1405)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.15/0.32 % (1411)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.15/0.32 % (1407)Instruction limit reached!
% 0.15/0.32 % (1407)------------------------------
% 0.15/0.32 % (1407)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (1407)Termination reason: Unknown
% 0.15/0.32 % (1407)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (1408)Instruction limit reached!
% 0.15/0.32 % (1408)------------------------------
% 0.15/0.32 % (1408)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (1408)Termination reason: Unknown
% 0.15/0.32 % (1408)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (1408)Memory used [KB]: 5500
% 0.15/0.32 % (1408)Time elapsed: 0.003 s
% 0.15/0.32 % (1408)Instructions burned: 2 (million)
% 0.15/0.32 % (1408)------------------------------
% 0.15/0.32 % (1408)------------------------------
% 0.15/0.32 % (1407)Memory used [KB]: 5500
% 0.15/0.32 % (1407)Time elapsed: 0.003 s
% 0.15/0.32 % (1407)Instructions burned: 2 (million)
% 0.15/0.32 % (1407)------------------------------
% 0.15/0.32 % (1407)------------------------------
% 0.15/0.32 % (1406)Refutation not found, incomplete strategy
% 0.15/0.32 % (1406)------------------------------
% 0.15/0.32 % (1406)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (1406)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.32
% 0.15/0.32
% 0.15/0.32 % (1406)Memory used [KB]: 5500
% 0.15/0.32 % (1406)Time elapsed: 0.003 s
% 0.15/0.32 % (1406)Instructions burned: 2 (million)
% 0.15/0.32 % (1406)------------------------------
% 0.15/0.32 % (1406)------------------------------
% 0.15/0.32 % (1404)First to succeed.
% 0.15/0.32 % (1411)Instruction limit reached!
% 0.15/0.32 % (1411)------------------------------
% 0.15/0.32 % (1411)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (1405)Also succeeded, but the first one will report.
% 0.15/0.32 % (1411)Termination reason: Unknown
% 0.15/0.32 % (1411)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (1411)Memory used [KB]: 5500
% 0.15/0.32 % (1411)Time elapsed: 0.004 s
% 0.15/0.32 % (1411)Instructions burned: 4 (million)
% 0.15/0.32 % (1411)------------------------------
% 0.15/0.32 % (1411)------------------------------
% 0.15/0.32 % (1409)Also succeeded, but the first one will report.
% 0.15/0.32 % (1404)Refutation found. Thanks to Tanya!
% 0.15/0.32 % SZS status Theorem for Vampire---4
% 0.15/0.32 % SZS output start Proof for Vampire---4
% See solution above
% 0.15/0.32 % (1404)------------------------------
% 0.15/0.32 % (1404)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (1404)Termination reason: Refutation
% 0.15/0.32
% 0.15/0.32 % (1404)Memory used [KB]: 5500
% 0.15/0.32 % (1404)Time elapsed: 0.004 s
% 0.15/0.32 % (1404)Instructions burned: 2 (million)
% 0.15/0.32 % (1404)------------------------------
% 0.15/0.32 % (1404)------------------------------
% 0.15/0.32 % (1403)Success in time 0.003 s
% 0.15/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------